Shortest path tree - PDFSEARCH.IO - Document Search Engine

Shortest path tree
Results: 178

#	Item
11	Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg Add to Reading List Source URL: ad-publications.informatik.uni-freiburg.de Language: English - Date: 2013-04-29 10:40:39 NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network
12	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm
13	Proceedings of the 15th International Symposium on Advances in Geographic Information Systems ACM GIS 2007 T ERRA S TREAM: From Elevation Data to Watershed Hierarchies∗ Andrew Danner Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:56 Network flow Graph connectivity Maximum flow problem Flow network Routing algorithms Connected component Tree Shortest path problem Graph traversal Eulerian path
14	Twig Patterns: From XML Trees to Graphs ∗ [Extended Abstract] Benny Kimelfeld and Yehoshua Sagiv Add to Reading List Source URL: db.ucsd.edu Language: English - Date: 2007-05-03 17:07:15 Combinatorial optimization Network theory Edsger W. Dijkstra Routing algorithms Spanning tree Shortest path problem Matching Graph database Sharp-P-completeness of 01-permanent Centrality
15	Optimal Efficiency Guarantees for Network Design Mechanisms? Tim Roughgarden??1 and Mukund Sundararajan? ? ?1 Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, CA 94305. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-04-09 01:40:43 Operations research Auction theory Mechanism design Game theory VickreyClarkeGroves mechanism Vickrey auction Optimization problem Mathematical optimization Steiner tree problem Shortest path problem Microeconomics
16	Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen Abstract— In this paper we present a design methodology Add to Reading List Source URL: www.researchgate.net Language: English Edsger W. Dijkstra Routing algorithms Graph theory Game artificial intelligence Search algorithms Shortest path problem Topology Pathfinding A* search algorithm Minimum spanning tree Visibility graph Motion planning
17	Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni1 and Thomas Rothvoß2 1 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:52 Computational complexity theory Operations research Facility location problem Steiner tree problem Shortest path problem Approximation algorithm Low-rank approximation
18	IEEE ROBOTICS AND AUTOMATION LETTERS. PREPRINT VERSION. DECEMBER, Lazy Data Association For Image Sequences Matching Under Substantial Appearance Changes Add to Reading List Source URL: europa2.informatik.uni-freiburg.de Language: English - Date: 2016-03-17 16:23:23 Mathematics Combinatorial optimization Graph theory Routing algorithms Edsger W. Dijkstra Search algorithms Game artificial intelligence A* search algorithm Shortest path problem Connectivity Matching Tree
19	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
20	Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:35 Graph theory Mathematics Edsger W. Dijkstra Spanning tree Combinatorial optimization Network theory Shortest path problem Connectivity Distributed computing Minimum spanning tree Clique Matching

UPDATE